Method and system for efficiently scheduling short range wireless data transmissions

ABSTRACT

According to one disclosed embodiment, a method for efficiently scheduling short-range wireless data transmissions is described. This method may include providing beacon intervals for timed data transmission, receiving a plurality of requests for data, delaying allocation of any of the plurality of requests for data into one of the beacon intervals until a number of admitted requests for data exceeds a threshold. The method may also include allocating timeslots for pseudo-static service periods before allocating timeslots for non-pseudo static service periods and allocating timeslots for non-pseudo static service periods in descending order of relative time urgency.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention is generally in the field of electronic circuitsand systems. More specifically, the present invention is in the field ofcommunications circuits and systems.

2. Background Art

In the field of wireless communications, 60 GHz technology pursues veryhigh throughput in short-range wireless data transmissions, makingpossible, for example, real-time uncompressed HD video and audiotransfers over wireless data networks. To enable this inherenthigh-speed data transfer, the 60 GHz standard explicitly defines arequirement called a Traffic Specification (TSPEC) for handling andallocating timeslots for data transfer between high-speed devices. TheTSPEC may specify an allocation period over which the allocationrepeats, a minimum allocation time and a maximum allocation time foreach high-speed data transfer, with each complete data transfercollectively called a traffic stream. Each traffic stream is furthercomprised of one or more individual timeframes during which data istransferred, called service periods. Typically, there are two types ofservice periods: 1) pseudo-static and 2) non-pseudo static.Pseudo-static service periods recur at the same target transmission timewithin an interval, called a beacon interval, regardless of whether thepseudo-static service periods occur in successive beacon intervals ornot, whereas non-pseudo static service periods are not required to recurat the same target transmission time within beacon intervals.

In a conventional 60 GHz data technology system a traffic stream isestablished between a Requesting Device and a Control Device, orunconventionally between two Requesting Devices. A Requesting Devicesends a data request carrying a TSPEC, which defines the timing andtraffic requirements of the data request. This data request is receivedby the Control Device. The Control Device determines whether to admitthe data request and if admitted, the Control Device may then allocateone or more service periods and announce the service period allocationscomprising the traffic stream to the one or more Requesting Devices.

Conventional service period scheduling approaches have traditionallydegraded the efficiency of time usage in the system during datatransmission in high-speed devices. FIG. 1 shows an exemplary timingdiagram representative of a conventional method for schedulingshort-range wireless data transmissions. FIG. 1 shows a plurality offixed-length beacon intervals, each including a length-varying non-datatransfer time (non-DTT) period 101 located at the beginning ofrespective beacon intervals, during which no data may be transferred.

According to this conventional scheduling approach, for example, theControl Device may receive multiple data requests carrying TSPEC1,TSPEC2, TSPEC3, TSPEC4, and TSPEC5, respectively, in time order. In thisconventional scheduling approach time slots are allocated for themaximum allocation needed to transfer the requested data in each serviceperiod as soon as the Control Device admits a TSPEC. Thus, the TSPEC 1service period 110 is allocated to beacon interval 1 adjacent thenon-DTT period 101 and the TSPEC2 service period 120 is then allocatedto beacon interval 1 adjacent TSPEC1 service period 110. However, whenthe Control Device receives and admits TSPEC3 service period 130, whichis pseudo-static having a period of one beacon interval, insufficienttimeslots are available in beacon interval 1 to allocate the TSPEC3service period 130. Thus, the Control Device is forced to allocate thefirst TSPEC3 service period 130 at the end of beacon interval 2, ratherthan beacon interval 1 and, because it recurs every beacon interval, tothe end of each of beacon intervals 3-8 as well, for example.

Moreover, according to a conventional scheduling approach, the ControlDevice might allocate the pseudo-static allocations of TSPEC4 serviceperiod 140, having a period of two beacon intervals, to every otherbeacon interval starting with beacon interval 2, as shown in FIG. 1. Ascan be seen, this inefficient allocation creates fragments of unusabletimeslots between non-DTT periods 101 and TSPEC4 service periods 140 inbeacon intervals 2 and 4. When the Control Device receives TSPEC5, theconventional scheduling algorithm cannot allocate its service period 150to beacon interval 2, as shown by the “X”, and is forced to allocate itto beacon interval 3 since the conventional scheduling algorithmallocates a service period for a particular request for data all at onceand immediately upon admission. Therefore, the conventional schedulingapproach tends to create unnecessary fragments of unusable timeslots inbeacons 2 and 4, and may fail the required allocation for TSPEC3 serviceperiod 130 in beacon interval 1, for example, as indicated in FIG. 1.

Thus, there is a need to overcome the drawbacks and deficiencies in theart by providing a service period scheduling solution enabling moreefficient allocation of data requests to each beacon interval, anddesigned to avoid failures in allocation of critical data.

SUMMARY OF THE INVENTION

The present invention is directed to a method and system for efficientlyscheduling short-range wireless data transmissions, substantially asshown in and/or described in connection with at least one of thefigures, as set forth more completely in the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

The features and advantages of the present invention will become morereadily apparent to those ordinarily skilled in the art after reviewingthe following detailed description and accompanying drawings, wherein:

FIG. 1 shows a timing diagram representative of a conventional methodfor scheduling short-range wireless data transmissions;

FIG. 2 shows a diagram of a system for efficiently schedulingshort-range wireless data transmissions, according to one embodiment ofthe present invention;

FIG. 3 shows a flowchart describing steps taken to implement a methodfor efficiently scheduling short-range wireless data transmissions,according to an embodiment of the present invention; and

FIG. 4 shows a timing diagram representative of a method for efficientlyscheduling short-range wireless data transmissions, according to anembodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

The present invention is directed to a method and system for efficientlyscheduling short range wireless data transmissions. The followingdescription contains specific information pertaining to theimplementation of the present invention. One skilled in the art willrecognize that the present invention may be implemented in a mannerdifferent from that specifically discussed in the present application.Moreover, some of the specific details of the invention are notdiscussed in order not to obscure the invention.

The drawings in the present application and their accompanying detaileddescription are directed to merely exemplary embodiments of theinvention. To maintain brevity, other embodiments of the presentinvention are not specifically described in the present application andare not specifically illustrated by the present drawings. It should beunderstood that unless noted otherwise, like or corresponding elementsamong the figures may be indicated by like or corresponding referencenumerals. Moreover, the drawings and illustrations in the presentapplication are generally not to scale, and are not intended tocorrespond to actual relative dimensions.

FIG. 2 shows system 200 for efficiently scheduling short-range wirelessdata transmissions, according to one embodiment of the presentinvention, which is capable of overcoming the drawbacks and deficienciesidentified with the conventional art. According to the embodiment ofFIG. 2, system 200 is configured to include at least Requesting Device210, shown in FIG. 2 and Control Device 220. Requesting Device 210 maycomprise receiver 212, processor 213, transmitter 214 and clock 215, andmay be configured to initiate one or more requests for data and receivetimed data transmissions embedded within one or more beacon intervals.Within Requesting Device 210, receiver 212 may be connected to processor213 and may be configured to receive timed data transmissions fromanother device, for example, Control Device 220, in the form of multipleservice periods embedded in one or more beacon intervals. Transmitter214 may also be connected to processor 213 and may be configured totransmit one or more requests for data to another device, for example,Control Device 220. Clock 215 may be connected to processor 213 and mayenable Requesting Device 210 to track timing intervals necessary to theoperation of one or more embodiments of the present invention.

Control Device 220 may comprise, for example, receiver 222, processor223, transmitter 224, clock 225, connection admission control (CAC)module 226 and Scheduling Module 228. Receiver 222 may be configured toreceive one or more requests for data from Requesting Device 210.Transmitter 224 may be connected to processor 223 and may be configuredto periodically transmit data embedded within one or more beaconintervals to Requesting Device 210. Clock 225 may be connected toprocessor 223 and may enable Control Device 220 to track timingintervals necessary to the operation of one or more embodiments of thepresent invention. Scheduling Module 228, connected to CAC module 226,receiver 222, transmitter 224 and processor 223, may be configured tooptimally schedule timed data transmissions during one or more beaconintervals after delaying allocation of a plurality of request for datauntil the number of admitted requests for data exceeds a certainthreshold, which is normally an engineering parameter that can be finetuned for better performance. This threshold may be sixteen (16)admitted requests for data, for example. However, one of ordinary skillwould understand that this threshold value may be more or less thansixteen (16) admitted requests for data depending on the particularapplication to which the present invention is applied. CAC Module 226,connected to receiver 222 and Scheduling Module 228, may be configuredto admit, delay or reject received requests for data from RequestingDevice 210 and if admitted, send those received requests for data toScheduling Module 228, for example, based on the number andcharacteristics of already admitted requests for data, which will bedescribed in greater depth in connection with FIGS. 3 and 4. It shouldbe understood that, although FIG. 2 discloses a Requesting Device 210and Control Device 220, the present invention may also includeembodiments in which Requesting Device 210 may also include thenecessary features to allow it to send data transmissions to one or moreother Requesting Devices 210 when required. In such a situation, theControl Device 220 may allocate all timed data transmissions accordingto an embodiment of the present invention. At the scheduled time fortransmission of data from one Requesting Device 210 to the one or moreother Requesting Devices 210, the data transmission may then occurbetween the one Requesting Device 210 and the one or more otherRequesting Devices 210, rather than between the Control Device 220 andthe Requesting Device 210. Thus, regardless of which devices timed datatransfers occur between, the Control Device 220 is responsible for thescheduling of all timed data transfers in the system.

The operation of system 200 will be further described by reference toFIGS. 3 and 4. FIG. 3 shows a flowchart describing steps taken toimplement a method for efficiently scheduling short-range wireless datatransmissions, according to one embodiment of the present invention,while FIG. 4 shows a timing diagram representative of a method forefficiently scheduling short-range wireless data transmissions utilizingone or more embodiments of the present invention. With respect to FIG.3, it is noted that certain details and features have been left out offlowchart 300 that are apparent to a person of ordinary skill in theart. For example, a step may comprise one or more substeps, as known inthe art. While steps 310 through 360 indicated in flowchart 300 aresufficient to describe at least one embodiment of the present method,other embodiments may utilize steps different from those shown inflowchart 300, or may include more, or fewer steps.

As shown in FIG. 3, step 310 of flowchart 300 comprises providing aplurality of beacon intervals for timed data transmission. Referring,for example, to FIG. 2, step 310 may be performed by Control Device 220in anticipation of receipt of one or more requests for data from one ormore Requesting Devices 210. According to WGA 60 GHz wirelessspecification, beacon intervals are simply fixed-length time periodsduring which data transmissions are scheduled to take place betweenhigh-speed devices, such as Requesting Device 210 and Control Device220. An example of typical beacon intervals is illustrated in FIGS. 1and 4 as beacon intervals 1-8.

Continuing with step 320 of FIG. 3, step 320 comprises receiving aplurality of requests for data. According to the embodiment shown inFIG. 2, for example, step 320 may correspond to receipt, by ControlDevice 220, of one or more requests for data from one or more RequestingDevices 210. Each such request for data may include a TSPEC which mayspecify, for example, the allocation period over which an allocation fordata transmission is required to repeat, as well as a minimum allocationtime and maximum allocation time for the requested data. This TSPECprovides data transmission information necessary to the initialcreation, modification, and allocation of the service periods whichcontain the requested data transmitted between devices.

Once Control Device 220 receives a request for data from a RequestingDevice 210, the Control Device 220 must determine whether it canaccommodate the new service period for transmission of the requesteddata within one or more upcoming beacon intervals by utilizing aconnection admission control (CAC) algorithm. According to theembodiment shown in FIG. 2, for example, the CAC algorithm may beimplemented by the CAC Module 226. The CAC algorithm admits, delays ordenies admission of a request for data according to a metric called thestress ratio, which is calculated by summing the required timeallocations of the service periods of all already admitted requests fordata and dividing this value by the total data transmission time periodof all allocated beacon intervals, which is equal to the total time ofall allocated beacon intervals minus the non data transmission (non-DTT)times 401, as shown in FIG. 4. If the current stress ratio is less thana certain threshold, 0.6 for example, the CAC algorithm may admit therequest for data for scheduling. This threshold is normally anengineering parameter that can be fine tuned for better systemperformance. Otherwise, the Control Device 220 lists up all availabletimeslots from all beacon intervals and determines if the needed amountof allocation, specified by the TSPEC contained in the request for data,can fit into the beacon intervals. If so, the request for data isadmitted for scheduling by Scheduling Module 228, for example. If not,the request for data is either delayed or denied by the CAC algorithm.It should be understood that since other threshold values may be used aswell, the present invention does not exclude the possibility of using adifferent threshold value. It should be further understood that the CACalgorithm may be implemented to admit requests for data before and afterthe number of admitted requests for data exceeds a certain threshold, aswill be disclosed next.

Moving on to step 330 of FIG. 3, step 330 comprises delaying allocationof any of the plurality of requests for data until the number ofadmitted requests for data exceeds a threshold. Step 330 may beperformed by Control Device 220, in FIG. 2, for example. Each admittedrequest for data, containing a respective TSPEC, is eventually allocateda certain time period, comprised of one or more service periods, withinone or more beacon intervals, during which the requested data may betransmitted from one device to another, for example, from Control Device220 to Requesting Device 210 of FIG. 2. However, rather than allocatingeach request for data immediately upon receipt, as is doneconventionally, an embodiment of the present invention may wait to beginscheduling and allocation until the number of admitted requests for dataexceeds a threshold, for example sixteen (16) admitted requests fordata, although this threshold may be greater or less than this numberdepending on the application to which the present invention is employed.This delay may also be signaled by including a delay element inside theTSPEC of a particular request for data. By waiting to allocate receivedrequests for data until a certain number of requests have been admittedallows the scheduling algorithm of the present invention to optimizescheduling and allocation such that the amount of unusable data transfertime within each beacon interval can be substantially minimized or eveneliminated altogether, allowing higher throughput and better efficiencyin the scheduling of short-range wireless transmissions. The effect ofstep 330 may be further shown in FIG. 4 in that no allocations are madeuntil requests for data containing TSPEC 1 through TSPEC 5 are received,necessitating allocation of TSPEC service periods 410 through 450,respectively.

As was previously stated, a TSPEC may specify one of two types ofservice periods for data transmission: 1) pseudo-static, wherein theservice period recurs at the same relative time offset within eachrespective beacon interval, and 2) non-pseudo static service periods,which do not. As can be seen in FIG. 4, TSPEC3 service periods 430 andTSPEC service periods 440 are pseudo-static while TSPEC1 service periods410, TSPEC2 service periods 420 and TSPEC5 service periods 450 arenon-pseudo static. As can be appreciated, due to the same offsetconstraint, pseudo-static service periods are inherently harder to findavailable time allocation consistently over beacon intervals, ascompared to non-pseudo-static service periods.

Therefore, step 340 comprises allocating timeslots for all pseudo-staticservice periods starting from the end of each of the respective beaconintervals. Referring, for example, to FIG. 2, step 340 may be performedby Scheduling Module 228. Allocating all pseudo-static service periodsstarting from the end of each of the respective beacon intervals allowseach pseudo-static service period to be allocated with the required sametime offset from one beacon interval to the next, while eliminatingshort unusable sections of data transfer time adjacent the non-DTTperiods 401 which result from non-DTT periods 401 being of varyinglength, as can be seen in FIG. 4. Furthermore, allocating timeslots forpseudo-static service periods before allocating timeslots for non-pseudostatic service periods further ensures that there is enough time in eachbeacon interval to allocate all admitted pseudo-static service periods.

According to an embodiment of the present invention, timeslots mayfurther be allocated for pseudo-static service periods in descendingorder of service period length. Because longer, repeating serviceperiods are harder to place than shorter ones, allocating pseudo-staticservice periods in descending order of service period length furtherensures that all service periods receive a proper allocation. Similarly,an embodiment of the present invention may further allocate timeslotsfor pseudo-static service periods in descending order of allocationfrequency. For similar reasons, repeating pseudo-static service periodsthat repeat more often are harder to place than those that repeat lessoften, and thus allocating in this way further ensures that all serviceperiods receive a proper allocation.

The effect of step 340 on timing and allocation is disclosed in FIG. 4.TSPEC3 service periods 430 and TSPEC4 service periods 440 arepseudo-static and so are allocated first, starting at the end of eachbeacon interval. However, because service periods 430 have longerservice period lengths and higher allocation frequency than serviceperiods 440, every one beacon interval versus every two beaconintervals, service periods 430 are allocated before service periods 440,according to step 340 of FIG. 3.

Additionally, step 350 of FIG. 3 comprises allocating timeslots for eachof the non-pseudo static service periods in order of relative timeurgency. Referring, for example, to FIG. 2, step 350 may also beperformed by Scheduling Module 228. For the purposes of the presentinvention, relative time urgency may be defined as the remainingtimeslots to be allocated within a current allocation period, divided bythe remaining time until the end of the allocation period, for eachnon-pseudo static service period. However, in the alternative, anembodiment of the present invention may allocate timeslots fornon-pseudo static service periods in ascending order of the remainingtime in an allocation period of each non-pseudo static service period.Thus, non-pseudo static service periods having a closer deadline as towhen they must be transmitted should be allocated first, among admittednon-pseudo static service periods. Where two or more admitted non-pseudostatic service periods have the same time remaining in their respectiveallocation periods, non-pseudo static service periods may be furtherallocated in descending order of service period duration. Regardless ofwhich algorithm is used to allocate timeslots for the non-pseudo staticservice periods, those timeslots should be allocated adjacent alreadyallocated pseudo-static service periods to ensure the closest possiblepacking of allocations within each beacon interval.

Step 360 of FIG. 3 comprises fragmenting each of the non-pseudo staticservice periods across multiple beacon intervals to more efficientlyfill each beacon interval. Referring, for example, to FIG. 2, step 360may also be performed by Scheduling Module 228. In an embodiment of thepresent invention, as long as the total allocation for all fragments ofa non-pseudo static service period total the maximum allocation and nofragment is smaller than the minimum allocation given by that serviceperiod's TSPEC, the allocation may consist of multiple, disjoint serviceperiods spread across multiple beacon intervals. Fragmentation andallocation of each non-pseudo static service period may be furtherdetermined according to relative time urgency as disclosed above. Whenthe allocation finishes for a beacon interval, Control Device 220 keepsperforming this allocation strategy until the remaining allocation forall admitted non-pseudo static service periods is zero.

The effect of steps 350 and 360 on timing and allocation is shown inFIG. 4 as well. TSPEC1 service periods 410, TSPEC2 service periods 420and TSPEC5 service periods 450 are non-pseudo static and so areallocated after and adjacent to pseudo static service periods withineach beacon interval. According to step 360 service periods 410, 420 and450 are fragmented across multiple beacon intervals to more efficientlyfill each beacon interval, allocated in an order according to relativetime urgency of each service period. Thus, beacon interval 1 includesnon-pseudo static service periods 410 a, 420 a and 450 a in fragmentlengths and order according to each of their respective relative timeurgencies calculated at the time of allocation into beacon interval 1.Similarly, beacon interval 2 includes non-pseudo static service periods410 b, 420 b and 450 b in fragment lengths and order according to eachof their respective relative time urgencies calculated at the time ofallocation into beacon interval 2. As can be seen in FIG. 4, a methodaccording to an embodiment of the present invention allows a moreefficient allocation of service periods into each of the beaconintervals substantially reducing or eliminating unusable fragments ofdata transmission time adjacent the non-data transmission times 401.Moreover, the result is a 100% allocation of all service periods withinthe first two beacon intervals, for example.

Thus, the present invention, according to various embodiments, allowsefficient scheduling of short-range wireless data transmissions whileminimizing or eliminating unusable data transmission time within beaconintervals in high-speed wireless data transmissions. Conventionalmethods have been incapable of guaranteeing proper allocation of alladmitted service periods within fixed-time beacon interval periods,however, the present invention, according to its various embodiments,addresses and eliminates these issues.

From the above description of the invention it is manifest that varioustechniques can be used for implementing the concepts of the presentinvention without departing from its scope. Moreover, while theinvention has been described with specific reference to certainembodiments, a person of ordinary skill in the art would appreciate thatchanges can be made in form and detail without departing from the spiritand the scope of the invention. Thus, the described embodiments are tobe considered in all respects as illustrative and not restrictive. Itshould also be understood that the invention is not limited to theparticular embodiments described herein but is capable of manyrearrangements, modifications, and substitutions without departing fromthe scope of the invention.

What is claimed is:
 1. A method for scheduling wireless datatransmissions, the method comprising: providing beacon intervals fortimed data transmission; receiving a plurality of requests for data;delaying allocation of any of the plurality of requests for data intoone of the beacon intervals until a number of admitted requests for dataexceeds a threshold; fragmenting non-pseudo static service periodsacross multiple of the beacon intervals; and allocating timeslots forthe non-pseudo static service periods in an order of relative timeurgency, wherein the relative time urgency is defined as the remainingtimeslots to be allocated within a current allocation period divided bythe remaining time until the end of the allocation period, for each ofthe non-pseudo static service periods.
 2. The method of claim 1, furthercomprising allocating timeslots for pseudo-static service periods beforeallocating timeslots for the non-pseudo static service periods.
 3. Themethod of claim 1, further comprising allocating timeslots forpseudo-static service periods in descending order of service periodlength.
 4. The method of claim 1, further comprising allocatingtimeslots for pseudo-static service periods in descending order ofallocation frequency.
 5. The method of claim 1, wherein timeslots forpseudo-static service periods are allocated at the same time offset ineach beacon interval for the same traffic stream.
 6. The method of claim1, further comprising allocating timeslots for the non-pseudo staticservice periods in ascending order of the remaining time in anallocation period of each of the non-pseudo static service periods. 7.The method of claim 1, further comprising allocating the non-pseudostatic service periods having equal time remaining in an allocationperiod in descending order of service period duration.
 8. The method ofclaim 1, wherein the order is a descending order.
 9. The method of claim1, further comprising admitting an additional request for data accordingto a connection admission control (CAC) algorithm after the number ofadmitted requests for data has exceeded the threshold and allocation hasbegun.
 10. The method of claim 9, wherein the CAC algorithm admits theadditional request if the additional requests for data can be allocatedinto available timeslots.
 11. A method for scheduling wireless datatransmissions, the method comprising: providing beacon intervals fortimed data transmission; receiving a plurality of requests for data;delaying allocation of any of the plurality of requests for data intoone of the beacon intervals until a number of admitted requests for dataexceeds a threshold; and fragmenting non-pseudo static service periodsacross multiple of the beacon intervals; wherein the fragmenting of thenon-pseudo static service periods across multiple beacon intervals isbased on relative time urgency, wherein the relative time urgency isdefined as the remaining timeslots to he allocated within a currentallocation period divided by the remaining time until the end of theallocation period, for each of the non-pseudo static service periods.12. The method of claim further comprising allocating timeslots forpseudo-static service periods before allocating timeslots for thenon-pseudo static service periods, and wherein the non-pseudo staticservice periods are allocated adjacent allocated pseudo-static serviceperiods.
 13. A method for scheduling wireless data transmissions, themethod comprising: providing beacon intervals for timed datatransmission; receiving a plurality of requests for data; delayingallocation of any of the plurality of requests for data into one of thebeacon intervals until a number of admitted requests for data exceeds athreshold; and fragmenting non-pseudo static service periods acrossmultiple of the beacon intervals; wherein the threshold is sixteenadmitted requests for data.
 14. A method for scheduling wireless datatransmissions, the method comprising: providing beacon intervals fortimed data transmission; receiving a plurality of requests for data;delaying allocation of any of the plurality of requests for data intoone of the beacon intervals until a number of admitted requests for dataexceeds a threshold; and admitting an additional request for dataaccording to a connection admission control (CAC) algorithm after thenumber of admitted requests for data has exceeded the threshold andallocation has begun; wherein the CAC algorithm admits the additionalrequest if the total required allocation for all admitted requests fordata divided by the total data transfer time of the beacon intervals isbelow a second threshold.
 15. The method of claim 14, wherein the secondthreshold is 0.6.
 16. A system for scheduling wireless datatransmissions, the system comprising: a control device including areceiver, a transmitter and a scheduling module, the control deviceconfigured to: provide beacon intervals for timed data transmission;receive a plurality of requests for data; delay allocation of any of theplurality of requests for data into one of the beacon intervals until anumber of admitted requests for data exceeds a threshold; and fragmentnon-pseudo static service periods across multiple of the beaconintervals; wherein the fragmenting of the non-pseudo static serviceperiods across multiple beacon intervals is based on relative timeurgency, wherein the relative time urgency is defined as the remainingtimeslots to he allocated within a current allocation period divided bythe remaining time until the end of the allocation period, for each ofthe non-pseudo static service periods.
 17. The system of claim 16,further comprising a requesting device configured to receive theplurality of service requests within the beacon intervals.
 18. Thesystem of claim 16, wherein the control device further includes aconnection admission control module configured to admit additionalrequests for data after allocation has begun based on availability oftimeslots within a respective beacon interval.
 19. The system of claim16, wherein the system utilizes a WGA 60 GHz wireless specification. 20.A system for scheduling wireless data transmissions, the systemcomprising: a control device including a receiver, a transmitter and ascheduling module, the control device configured to: provide beaconintervals for timed data transmission; receive a plurality of requestsfor data; delay allocation of any of the plurality of requests for datainto one of the beacon intervals until a number of admitted requests fordata exceeds a threshold; and admit an additional request for dataaccording to a connection admission control (CAC) algorithm after thenumber of admitted requests for data has exceeded the threshold andallocation has begun, wherein the CAC algorithm admits the additionalrequest if the total required allocation for all admitted requests fordata divided by the total data transfer time of the beacon intervals isbelow a second threshold.